Probability and Problems in Euclidean Combinatorial Optimization
نویسندگان
چکیده
منابع مشابه
Probability and Problems in Euclidean Combinatorial Optimization
This article summarizes the current status of several streams of research that deal with the probability theory of problems of combinatorial optimization. There is a particular emphasis on functionals of finite point sets. The most famous example of such functionals is the length associated with the Euclidean traveling salesman problem (TSP), but closely related problems include the minimal spa...
متن کاملAnalysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces
Probabilistic combinatorial optimization problems are generalized versions of deterministic combinatorial optimization problems with explicit inclusion of probabilistic elements in the problem deenitions. Based on the probabilistic traveling salesman problem (PTSP) and on the probabilistic minimum spanning tree problem (PMSTP), the objective of this paper is to give a rigorous treatment of the ...
متن کاملCombinatorial Problems in Compiler Optimization
Several important compiler optimizations such as instruction scheduling and register allocation are fundamentally hard and are usually solved using heuristics or approximate solutions. In contrast, this thesis examines optimal solutions to three combinatorial problems in compiler optimization. The first problem addresses instruction scheduling for clustered architectures, popular in embedded sy...
متن کاملRates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems
Rates of convergence of limit theorems are established for a class of random processes called here quasi-additive smooth Euclidean functionals. Examples include the objective functions of the traveling salesman problem, the Steiner tree problem, the minimumspanning tree problem, the minimumweight matching problem, and a variant of the minimum spanning tree problem with power weighted edges.
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Science
سال: 1993
ISSN: 0883-4237
DOI: 10.1214/ss/1177011083